Near-Optimal Broadcast in All-Port Wormhole-Routed 3D Tori with Dimension-Ordered Routing
نویسندگان
چکیده
The one-to-all broadcast is the most primary operation in a multicomputer network. In this paper, we study this problem in a wormhole-routed 3D torus which provides the dimension-ordered routing and the all-port communication capability. We propose an efficient scheme to utilize the distance-insensitive characteristic of wormhole routing. The scheme requires at most 4 steps more than the optimal number of steps for any square 3D torus. The best known results, as compared to ours, can only be applied to cubic tori of very restricted network sizes and either rely on an undesirable non-dimension-ordered routing or require more numbers of steps.
منابع مشابه
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
The one-to-all broadcast is the most primary collective communication pattern in a multicomputer network. We consider this problem in a wormhole-routed torus which uses all-port and dimension-ordered routing model. We derive our routing algorithms based on the concept of "span of vector spaces" in linear algebra. For instance, in a 3-D torus, the nodes receiving the broadcast message will be "s...
متن کاملToward Optimal Complete Exchange on Wormhole-Routed Tori
ÐIn this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. On tori of equal size along each dimension, our algorithms use both asymptotically optimal startup and transmission time. The results are characterized by several interesting features: 1) the use of gather-scatter tree to achieve opti...
متن کاملMulti-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy
In this paper, we investigate the multi-node broadcasting problem in a 3-D torus, where there are an unknown number of s source nodes located at unknown positions each intending to broadcast a message of size m bytes to the rest of the network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Existing congestion-free results are derived based on finding ...
متن کاملBroadcasting on Wormhole-Routed 2D Tori with Arbitrary Size
* This work was supported by National Science Council, Republic of China, under Grant NSC88-2213-E-001-008. Abstract For distributed memory parallel computers, broadcast operations are widely used in a variety of applications. In this paper, we propose an efficient algorithm for broadcasting on an all-port wormhole-routed 2D torus with arbitrary size. The underlying network is assumed to suppor...
متن کاملMulti-Node Broadcasting in a Wormhole-Routed 2-D Torus Using an Aggregation-then-Distribution Strategy
This paper presents an efficient multi-node broadcasting algorithm in a wormhole-routed 2-D torus, where there are an unknown number of s source nodes located on unknown positions each intending to broadcast a message of size m bytes to the rest of network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Most existing results are derived based on findin...
متن کامل